ar X iv : m at h / 05 08 08 9 v 4 [ m at h . PR ] 1 6 Ja n 20 06 Position play in carom billiards as a Markov process

نویسنده

  • Mathieu Bouville
چکیده

Position play is a key feature of carom billiards: players try to score while ensuring that the next position will be favorable. The difficulty of a shot therefore depends on that of the previous shot, e.g. an easy shot generally follows an easy shot. We introduce a Markov process which accounts for such correlations. It can explain the long series of easy shots and the high scores which ensue. We also show that there exist differences in the kinds of points on which players playing at different skill levels score most. The players can easily use the model through the web page http://billiards.mathieu.bouville.name/biMar/.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : m at h / 05 08 08 9 v 3 [ m at h . PR ] 1 9 Se p 20 05 Position play in carom billiards as a Markov process

In carom billiards position play is a key feature of the “small games”. Playing position means that the player plays so as to score a point and ensure that the next point will be an easy one. This way a player can have long series of easy shots and high scores. However the usual model for carom billiards assumes a Bernoulli process in which there is no correlation between subsequent shots. Usin...

متن کامل

ar X iv : m at h / 05 08 08 9 v 1 [ m at h . PR ] 4 A ug 2 00 5 Position play in carom billiards as a Markov process

Using certain techniques a billiards player can have long series of easy shots — each shot leading to another easy shot— and very high scores. As the usual model for carom billiards assumes a Bernoulli process which does not account for such correlations, it cannot capture this important feature of the game. Modelling carom billiards as a Markov process, the probability to make a shot can be ma...

متن کامل

ar X iv : m at h / 04 06 08 3 v 3 [ m at h . PR ] 1 7 Ju n 20 05 Large deviations for empirical entropies of g - measures

The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x1 using the entropy of the k-block empirical probability and letting k grow with n roughly like logn. We further assume that the distribution of the process is a g-measure. We prove large deviation principles for conditional, non-conditional and relative k(n)-block empirical entropies.

متن کامل

ar X iv : m at h / 05 06 26 9 v 1 [ m at h . PR ] 1 4 Ju n 20 05 Percolation , boundary , noise : an experiment

The scaling limit of the critical percolation, is it a black noise? The answer depends on stability to perturbations concentrated along a line. This text, containing no proofs, reports experimental results that suggest the affirmative answer.

متن کامل

ar X iv : m at h / 05 04 08 2 v 4 [ m at h . D G ] 1 5 A pr 2 00 6 COMPLETE PROJECTIVE CONNECTIONS

The first examples of complete projective connections are uncovered: on surfaces, normal projective connections whose geodesics are all closed and embedded are complete. On manifolds of any dimension, normal projective connections induced from complete affine connections with slowly decaying positive Ricci curvature are complete.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006